On dynamic coloring for planar graphs and graphs of higher genus

نویسندگان

  • Ye Chen
  • Suohai Fan
  • Hong-Jian Lai
  • Huimin Song
  • Lei Sun
چکیده

For integers k, r > 0, a (k, r)-coloring of a graph G is a proper coloring on the vertices of G by k colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{d(v), r} different colors. The dynamic chromatic number, denoted by χ2(G), is the smallest integer k for which a graph G has a (k, 2)-coloring. A list assignment L of G is a function that assigns to every vertex v of G a set L(v) of positive integers. For a given list assignment L of G, an (L, r)-coloring of G is a proper coloring c of the vertices such that every vertex v of degree d(v) is adjacent to vertices with at least min{d(v), r} different colors and c(v) ∈ L(v). The dynamic choice number of G, ch2(G), is the least integer k such that every list assignment L with |L(v)| = k, ∀v ∈ V (G), permits an (L, 2)-coloring. It is known that for any graph G, χr (G) ≤ chr (G). Using Euler distributions in this paper, we prove the following results, where (2) and (3) are best possible. (1) If G is planar, then ch2(G) ≤ 6. Moreover, ch2(G) ≤ 5 when ∆(G) ≤ 4. (2) If G is planar, then χ2(G) ≤ 5. (3) If G is a graph with genus g(G) ≥ 1, then ch2(G) ≤ 2 (7 + √ 1 + 48g(G)). © 2012 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

-λ coloring of graphs and Conjecture Δ ^ 2

For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...

متن کامل

Edge-Coloring and f-Coloring for Various Classes of Graphs

In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f -coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a positive integer assigned to v. This paper gives efficient sequential and parallel algorithms to find ordinary edge-colorings and f -colorings for various classes of graphs such as bi...

متن کامل

A Simple Competitive Graph Coloring Algorithm

We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this result to give very easy proofs of the best known upper bounds on game coloring number for forests, i...

متن کامل

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs

We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for coloring within 2 of the optimal chromatic number, which is essentially best possible, and generalizes the seminal result by Thomassen [32] for bounded-genus graphs. This result also improves our understanding from an algori...

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 160  شماره 

صفحات  -

تاریخ انتشار 2012